A Semidefinite Programming based approach for finding Bayesian optimal designs for nonlinear models
نویسندگان
چکیده
This paper uses Semidefinite Programming (SDP) to construct Bayesian optimal design for nonlinear regression models. The setup here extends the formulation of the optimal designs problem as a SDP problem from linear to nonlinear models. Gaussian Quadrature Formulas (GQF) are used to compute the expectation in the Bayesian design criterion, such as D-, Aor E-optimality. As an illustrative example, we demonstrate the approach using the power logistic model and compare results in the literature. Additionally, we investigate how the optimal design is impacted by different discretizing schemes for the design space, different amount of uncertainty in the parameter values, different choices of GQF and different prior distributions for the vector of model parameters, including normal priors with and without correlated components. Further applications to find Bayesian Doptimal designs with two regressors for a logistic model and a two-variable generalized linear model with a gamma distributed response are discussed and some limitations of our approach are noted. AMS 2000 subject classifications: Primary 62K05, 90C22; secondary 65D32.
منابع مشابه
Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming-Based Approach.
This paper uses semidefinite programming (SDP) to construct Bayesian optimal design for nonlinear regression models. The setup here extends the formulation of the optimal designs problem as an SDP problem from linear to nonlinear models. Gaussian quadrature formulas (GQF) are used to compute the expectation in the Bayesian design criterion, such as D-, A- or E-optimality. As an illustrative exa...
متن کاملAdaptive grid semidefinite programming for finding optimal designs
We find optimal designs for linear models using a novel algorithm that iteratively combines a Semidefinite Programming (SDP) approach with adaptive grid (AG) techniques. The search space is first discretized and SDP is applied to find the optimal design based on the initial grid. The points in the next grid set are points that maximize the dispersion function of the SDP-generated optimal design...
متن کاملCost Analysis of Acceptance Sampling Models Using Dynamic Programming and Bayesian Inference Considering Inspection Errors
Acceptance Sampling models have been widely applied in companies for the inspection and testing the raw material as well as the final products. A number of lots of the items are produced in a day in the industries so it may be impossible to inspect/test each item in a lot. The acceptance sampling models only provide the guarantee for the producer and consumer that the items in the lots are acco...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملOptimal designs for regression models using the second-order least squares estimator
We investigate properties and numerical algorithms for Aand D-optimal regression designs based on the second-order least squares estimator (SLSE). Several theoretical results are derived, including an innovative expression to characterize the A-optimality criterion. We can formulate the optimal design problems under SLSE as semidefinite programming or convex optimization problems and show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013